INSIDE CS Department of Computer Science SPRING 2009
نویسنده
چکیده
by Prof. Larry Davis An item hot off the press is that the Department’s undergraduate programming team, coached by Amol Deshpande, went to Stockholm to compete with squads from all over the world in a programming contest known as the “Battle of the Brains.” Our team placed 20th, and only three other U.S. universities did better or as well – MIT placed 7’th, CMU 12th and Stanford tied with us for 20th. The top ten teams were mostly from Russia and China. The students on the UM team were Alan Jackoway, Mitchell Katz and Matt McCutchen. This is a tremendous accomplishment, plus a good time in Europe.
منابع مشابه
Algorithms Department of Computer Science University of Illinois at Urbana - Champaign
• Spring 1999: Mitch Harris and Shripad Thite • Summer 1999 (IMCS): Mitch Harris • Summer 2000 (IMCS): Mitch Harris • Fall 2000: Chris Neihengen, Ekta Manaktala, and Nick Hurlburt • Spring 2001: Brian Ensink, Chris Neihengen, and Nick Hurlburt • Summer 2001 (I2CS): Asha Seetharam and Dan Bullok • Fall 2002: Erin Wolf, Gio Kao, Kevin Small, Michael Bond, Rishi Talreja, Rob McCann, and Yasutaka F...
متن کاملEmerging Scholars Program—A PLTL-CS Program That Increases Recruitment and Retention of Women in the Major
The Emerging Scholars Program (ESP) in Computer Science is a Peer Led Team Learning (PLTL) approach to bringing undergraduates new to the discipline together with peer mentors to work on computational problems, and to expose them to the broad array of disciplines within computer science. This program demonstrates that computer science is necessarily a collaborative activity that focuses more on...
متن کاملar X iv : 0 90 9 . 31 27 v 1 [ cs . C G ] 1 6 Se p 20 09 On the largest empty axis - parallel box amidst n points
We give the first nontrivial upper and lower bounds on the maximum volume of an empty axisparallel box inside an axis-parallel unit hypercube in R containing n points. For a fixed d, we show that the maximum volume is of the order Θ( 1 n ). We then use the fact that the maximum volume is Ω( 1 n ) in our design of the first efficient (1 − ε)-approximation algorithm for the following problem: Giv...
متن کاملDepartment of Computer Science Spring 2008 9 Course 236610 : Research Laboratory in Theoretical Computer Science
Preface In our research laboratory we plan to study selected results from the eld of additive com-binatorics and some of their applications to theoretical computer science. A tentative list of results includes • Roth's Theorem about the existence of arithmetic progressions of length 3 in dense subsets of Z m p. • The Gowers norm and Samorodnitsky's Theorem about testing quadratic functions over...
متن کاملSession T3C CLOSING THE CS I - CS II GAP: A BREADTH-SECOND APPROACH
Pearl Brazier, University of Texas – Pan American, Department of Computer Science, Edinburg, TX 78539, [email protected] 2 Laura Grabowski, University of Texas – Pan American, Department of Computer Science, Edinburg, TX 78539, [email protected] 3 Gustavo Dietrich, University of Texas – Pan American, Department of Computer Science, Edinburg, TX 78539, [email protected] Abstract Many stu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009